0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.33	% Computer : n016.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1920
0.11/0.33	% WCLimit    : 240
0.11/0.33	% DateTime   : Wed Jul 30 02:23:49 EDT 2025
0.11/0.33	% CPUTime    : 
0.19/0.47	Running higher-order theorem proving
0.19/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p
1044.07/131.69	# Version: 3.0.0-ho
1044.07/131.69	# Preprocessing class: HSSSSMSSSSSNSSA.
1044.07/131.69	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1044.07/131.69	# Starting post_as_ho12 with 240s (1) cores
1044.07/131.69	# Starting new_bool_9 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho1 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho4 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho2 with 240s (1) cores
1044.07/131.69	# Starting ehoh_best2_full_lfho with 240s (1) cores
1044.07/131.69	# Starting full_lambda_10 with 240s (1) cores
1044.07/131.69	# Starting new_ho_8 with 240s (1) cores
1044.07/131.69	# full_lambda_10 with pid 31437 completed with status 0
1044.07/131.69	# Result found by full_lambda_10
1044.07/131.69	# Preprocessing class: HSSSSMSSSSSNSSA.
1044.07/131.69	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1044.07/131.69	# Starting post_as_ho12 with 240s (1) cores
1044.07/131.69	# Starting new_bool_9 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho1 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho4 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho2 with 240s (1) cores
1044.07/131.69	# Starting ehoh_best2_full_lfho with 240s (1) cores
1044.07/131.69	# Starting full_lambda_10 with 240s (1) cores
1044.07/131.69	# SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
1044.07/131.69	# Search class: HGHPF-FFSS11-SSSFFFBN
1044.07/131.69	# partial match(3): HGHNF-FFSF11-SSSFFMBN
1044.07/131.69	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
1044.07/131.69	# Starting post_as_ho2 with 130s (1) cores
1044.07/131.69	# post_as_ho2 with pid 31446 completed with status 8
1044.07/131.69	# Starting full_lambda_10 with 25s (1) cores
1044.07/131.69	# full_lambda_10 with pid 3421 completed with status 0
1044.07/131.69	# Result found by full_lambda_10
1044.07/131.69	# Preprocessing class: HSSSSMSSSSSNSSA.
1044.07/131.69	# Scheduled 8 strats onto 8 cores with 240 seconds (1920 total)
1044.07/131.69	# Starting post_as_ho12 with 240s (1) cores
1044.07/131.69	# Starting new_bool_9 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho1 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho4 with 240s (1) cores
1044.07/131.69	# Starting post_as_ho2 with 240s (1) cores
1044.07/131.69	# Starting ehoh_best2_full_lfho with 240s (1) cores
1044.07/131.69	# Starting full_lambda_10 with 240s (1) cores
1044.07/131.69	# SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
1044.07/131.69	# Search class: HGHPF-FFSS11-SSSFFFBN
1044.07/131.69	# partial match(3): HGHNF-FFSF11-SSSFFMBN
1044.07/131.69	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
1044.07/131.69	# Starting post_as_ho2 with 130s (1) cores
1044.07/131.69	# post_as_ho2 with pid 31446 completed with status 8
1044.07/131.69	# Starting full_lambda_10 with 25s (1) cores
1044.07/131.69	# Preprocessing time       : 0.001 s
1044.07/131.69	# Presaturation interreduction done
1044.07/131.69	
1044.07/131.69	# Proof found!
1044.07/131.69	# SZS status Theorem
1044.07/131.69	# SZS output start CNFRefutation
1044.07/131.69	thf(decl_23, type, one: $i).
1044.07/131.69	thf(decl_24, type, two: $i).
1044.07/131.69	thf(decl_25, type, b1: $o > $i).
1044.07/131.69	thf(decl_26, type, b2: $o > $i).
1044.07/131.69	thf(decl_27, type, esk1_0: $o > $i).
1044.07/131.69	thf(decl_28, type, esk2_0: $o).
1044.07/131.69	thf(decl_29, type, esk3_0: $o).
1044.07/131.69	thf(goal, conjecture, ![X2:$o > $i]:(((((X2)=(b2))|((X2)=(b1)))<=![X1:$o]:(((X2 @ ((X1)))!=(X2 @ (~((X1)))))))), file('/export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p', goal)).
1044.07/131.69	thf(b1, axiom, ![X1:$o]:(((((b1 @ ((X1)))=(one))<=(X1))&(~((X1))=>((b1 @ ((X1)))=(two))))), file('/export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p', b1)).
1044.07/131.69	thf(binarity_exhaust, axiom, ![X3:$i]:((((X3)=(one))|((X3)=(two)))), file('/export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p', binarity_exhaust)).
1044.07/131.69	thf(b2, axiom, ![X1:$o]:(((~((X1))=>((b2 @ ((X1)))=(one)))&(((b2 @ ((X1)))=(two))<=(X1)))), file('/export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p', b2)).
1044.07/131.69	thf(binarity_distinc, axiom, ((one)!=(two)), file('/export/starexec/sandbox/tmp/tmp.g1vFh7NaKC/E---3.1_31353.p', binarity_distinc)).
1044.07/131.69	thf(c_0_5, negated_conjecture, ~(![X2:$o > $i]:((![X1:$o]:(~((((X1)|((X2 @ ((X1)))=(X2 @ $true)))&(~(X1)|((X2 @ ((X1)))=(X2 @ $false))))))=>(((X2)=(b2))|((X2)=(b1)))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[goal])])])).
1044.07/131.69	thf(c_0_6, negated_conjecture, ![X10:$o]:((((((X10)|~(X10))&(((esk1_0 @ ((X10)))!=(esk1_0 @ $false))|~(X10)))&(((X10)|((esk1_0 @ ((X10)))!=(esk1_0 @ $true)))&(((esk1_0 @ ((X10)))!=(esk1_0 @ $false))|((esk1_0 @ ((X10)))!=(esk1_0 @ $true)))))&(((esk1_0)!=(b2))&((esk1_0)!=(b1))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])])).
1044.07/131.69	thf(c_0_7, plain, ![X1:$o]:((((X1)=>((b1 @ ((X1)))=(one)))&(~(X1)=>((b1 @ ((X1)))=(two))))), inference(fof_simplification,[status(thm)],[b1])).
1044.07/131.69	thf(c_0_8, negated_conjecture, ((esk1_0)!=(b1)), inference(split_conjunct,[status(thm)],[c_0_6])).
1044.07/131.69	thf(c_0_9, plain, ![X11:$o]:(((~(X11)|((b1 @ ((X11)))=(one)))&((X11)|((b1 @ ((X11)))=(two))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
1044.07/131.69	thf(c_0_10, plain, ![X13:$i]:((((X13)=(one))|((X13)=(two)))), inference(variable_rename,[status(thm)],[binarity_exhaust])).
1044.07/131.69	thf(c_0_11, negated_conjecture, ((b1 @ ((esk2_0)))!=(esk1_0 @ ((esk2_0)))), inference(neg_ext,[status(thm)],[c_0_8])).
1044.07/131.69	thf(c_0_12, plain, ((b1 @ (($true)))=(one)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])])).
1044.07/131.69	thf(c_0_13, plain, ![X3:$i]:((((X3)=(one))|((X3)=(two)))), inference(split_conjunct,[status(thm)],[c_0_10])).
1044.07/131.69	thf(c_0_14, plain, ((b1 @ (~($true)))=(two)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])])).
1044.07/131.69	thf(c_0_15, plain, ![X1:$o]:(((~(X1)=>((b2 @ ((X1)))=(one)))&((X1)=>((b2 @ ((X1)))=(two))))), inference(fof_simplification,[status(thm)],[b2])).
1044.07/131.69	thf(c_0_16, plain, (((esk1_0 @ ((esk2_0)))!=(one))|~((esk2_0))), inference(ext_sup,[status(thm)],[c_0_11, c_0_12])).
1044.07/131.69	thf(c_0_17, plain, ![X8:$i, X3:$i]:((((X3)=(one))|((X8)=(one))|((X8)=(X3)))), inference(spm,[status(thm)],[c_0_13, c_0_13])).
1044.07/131.69	thf(c_0_18, plain, ((esk2_0)|((esk1_0 @ ((esk2_0)))!=(two))), inference(ext_sup,[status(thm)],[c_0_11, c_0_14])).
1044.07/131.69	thf(c_0_19, negated_conjecture, ((esk1_0)!=(b2)), inference(split_conjunct,[status(thm)],[c_0_6])).
1044.07/131.69	thf(c_0_20, plain, ![X12:$o]:((((X12)|((b2 @ ((X12)))=(one)))&(~(X12)|((b2 @ ((X12)))=(two))))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
1044.07/131.69	thf(c_0_21, negated_conjecture, ((esk1_0 @ (($true)))!=(esk1_0 @ (~($true)))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6])])])).
1044.07/131.69	thf(c_0_22, plain, ![X3:$i]:((((esk1_0 @ (($true)))=(X3))|((X3)=(one))|~((esk2_0)))), inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17])])).
1044.07/131.69	thf(c_0_23, plain, (((esk1_0 @ (~($true)))=(one))|(esk2_0)), inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_13])])).
1044.07/131.69	thf(c_0_24, negated_conjecture, ((b2 @ ((esk3_0)))!=(esk1_0 @ ((esk3_0)))), inference(neg_ext,[status(thm)],[c_0_19])).
1044.07/131.69	thf(c_0_25, plain, ((b2 @ (($true)))=(two)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_20])])])).
1044.07/131.69	thf(c_0_26, plain, ((b2 @ (~($true)))=(one)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_20])])])).
1044.07/131.69	thf(c_0_27, negated_conjecture, ((esk1_0 @ (~($true)))=(one)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])).
1044.07/131.69	thf(c_0_28, plain, (((esk1_0 @ ((esk3_0)))!=(two))|~((esk3_0))), inference(ext_sup,[status(thm)],[c_0_24, c_0_25])).
1044.07/131.69	thf(c_0_29, plain, ((one)!=(two)), inference(fof_simplification,[status(thm)],[binarity_distinc])).
1044.07/131.69	thf(c_0_30, plain, ((esk3_0)|((esk1_0 @ ((esk3_0)))!=(one))), inference(ext_sup,[status(thm)],[c_0_24, c_0_26])).
1044.07/131.69	thf(c_0_31, negated_conjecture, ((esk1_0 @ (($true)))!=(one)), inference(rw,[status(thm)],[c_0_21, c_0_27])).
1044.07/131.69	thf(c_0_32, plain, (((esk1_0 @ (($true)))=(one))|~((esk3_0))), inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_13])])).
1044.07/131.69	thf(c_0_33, plain, ((one)!=(two)), inference(fof_nnf,[status(thm)],[c_0_29])).
1044.07/131.69	thf(c_0_34, plain, ![X3:$i]:((((esk1_0 @ (~($true)))=(X3))|((X3)=(one))|(esk3_0))), inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_17])])).
1044.07/131.69	thf(c_0_35, plain, ~((esk3_0)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
1044.07/131.69	thf(c_0_36, plain, ((one)!=(two)), inference(split_conjunct,[status(thm)],[c_0_33])).
1044.07/131.69	thf(c_0_37, plain, ![X3:$i]:(((one)=(X3))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_27])]), c_0_35])).
1044.07/131.69	thf(c_0_38, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36, c_0_37])]), ['proof']).
1044.07/131.69	# SZS output end CNFRefutation
1044.07/131.69	# Parsed axioms                        : 9
1044.07/131.69	# Removed by relevancy pruning/SinE    : 4
1044.07/131.69	# Initial clauses                      : 12
1044.07/131.69	# Removed in clause preprocessing      : 1
1044.07/131.69	# Initial clauses in saturation        : 11
1044.07/131.69	# Processed clauses                    : 80
1044.07/131.69	# ...of these trivial                  : 0
1044.07/131.69	# ...subsumed                          : 32
1044.07/131.69	# ...remaining for further processing  : 48
1044.07/131.69	# Other redundant clauses eliminated   : 22
1044.07/131.69	# Clauses deleted for lack of memory   : 0
1044.07/131.69	# Backward-subsumed                    : 10
1044.07/131.69	# Backward-rewritten                   : 24
1044.07/131.69	# Generated clauses                    : 304
1044.07/131.69	# ...of the previous two non-redundant : 200
1044.07/131.69	# ...aggressively subsumed             : 0
1044.07/131.69	# Contextual simplify-reflections      : 1
1044.07/131.69	# Paramodulations                      : 238
1044.07/131.69	# Factorizations                       : 34
1044.07/131.69	# NegExts                              : 2
1044.07/131.69	# Equation resolutions                 : 23
1044.07/131.69	# Disequality decompositions           : 0
1044.07/131.69	# Total rewrite steps                  : 38
1044.07/131.69	# ...of those cached                   : 22
1044.07/131.69	# Propositional unsat checks           : 0
1044.07/131.69	#    Propositional check models        : 0
1044.07/131.69	#    Propositional check unsatisfiable : 0
1044.07/131.69	#    Propositional clauses             : 0
1044.07/131.69	#    Propositional clauses after purity: 0
1044.07/131.69	#    Propositional unsat core size     : 0
1044.07/131.69	#    Propositional preprocessing time  : 0.000
1044.07/131.69	#    Propositional encoding time       : 0.000
1044.07/131.69	#    Propositional solver time         : 0.000
1044.07/131.69	#    Success case prop preproc time    : 0.000
1044.07/131.69	#    Success case prop encoding time   : 0.000
1044.07/131.69	#    Success case prop solver time     : 0.000
1044.07/131.69	# Current number of processed clauses  : 4
1044.07/131.69	#    Positive orientable unit clauses  : 0
1044.07/131.69	#    Positive unorientable unit clauses: 1
1044.07/131.69	#    Negative unit clauses             : 3
1044.07/131.69	#    Non-unit-clauses                  : 0
1044.07/131.69	# Current number of unprocessed clauses: 140
1044.07/131.69	# ...number of literals in the above   : 429
1044.07/131.69	# Current number of archived formulas  : 0
1044.07/131.69	# Current number of archived clauses   : 44
1044.07/131.69	# Clause-clause subsumption calls (NU) : 79
1044.07/131.69	# Rec. Clause-clause subsumption calls : 64
1044.07/131.69	# Non-unit clause-clause subsumptions  : 25
1044.07/131.69	# Unit Clause-clause subsumption calls : 18
1044.07/131.69	# Rewrite failures with RHS unbound    : 0
1044.07/131.69	# BW rewrite match attempts            : 21
1044.07/131.69	# BW rewrite match successes           : 14
1044.07/131.69	# Condensation attempts                : 80
1044.07/131.69	# Condensation successes               : 6
1044.07/131.69	# Termbank termtop insertions          : 2226
1044.07/131.69	# Search garbage collected termcells   : 161
1044.07/131.69	
1044.07/131.69	# -------------------------------------------------
1044.07/131.69	# User time                : 128.915 s
1044.07/131.69	# System time              : 1.223 s
1044.07/131.69	# Total time               : 130.138 s
1044.07/131.69	# Maximum resident set size: 1784 pages
1044.07/131.69	
1044.07/131.69	# -------------------------------------------------
1044.07/131.69	# User time                : 128.920 s
1044.07/131.69	# System time              : 1.226 s
1044.07/131.69	# Total time               : 130.146 s
1044.07/131.69	# Maximum resident set size: 1728 pages
1044.07/131.69	% E exiting
1044.07/131.69	% E exiting
1044.07/131.69	EOF